Cyclic Scheduling of Multimodal Processes in Crystalline-like Network Structures
نویسندگان
چکیده
The paper introduces the concept of a crystalline-like model of a computer communication network (CCN) composed of routers forming a repeating or periodic arrangement. The considered homogenous network assumes the same routers servicing the same number of transmissions form an array. In such a network several isomorphic sub-networks encompassing packet transmission processes serviced by each router, interact each other as to provide a variety of demand-responsive host-server transmission services. In that context, a crystalline-like layout of physically different, however functionally identical, routers provides a homogenous array supporting computer network flows. In turn, packet transmission flows are treated as multimodal processes encompassing arbitrarily given inter-computer communications. Assuming the packets passing their origin-destination routes are synchronized by the same mechanism of packet transmission the problem boils down to a communication processes scheduling. Since concurrent transmission flows are processed along the same presumed routes, hence the schedules sought are cyclic ones. In general case, cycles of multimodal processes depend on CNN’s periodicity. That objective to develop conditions allowing one to calculate the cyclic schedule of whole CCN while taking into account only periodicity of its repeating isomorphic structure. © 2014 The Authors. Published by Elsevier B.V. Peer-review under responsibility of KES International.
منابع مشابه
Cyclic Scheduling of Multimodal Concurrently Flowing Processes
The problem of cyclic scheduling of multimodal concurrent processes (MCPs) is considered. Processes composed of sub-sequences of local cyclic processes (LCPs) are treated as multimodal processes, e.g. in case local processes encompass the subway lines network the relevant multimodal processes can be seen as passengers traveling itineraries this network. Since LCPs network implies a MCPs behavio...
متن کاملMultimodal Processes Rescheduling
Cyclic scheduling problems concerning multimodal processes are usually observed in FMSs producing multi-type parts where the Automated Guided Vehicles System (AGVS) plays a role of a material handling system. Schedulability analysis of concurrently flowing cyclic processes (SCCP) executed in these kinds of systems can be considered using a declarative modeling framework. Proposed representation...
متن کاملToward Cyclic Scheduling of Concurrent Multimodal Processes
The problem of cyclic scheduling of multimodal cyclic processes (MCPs) is considered. The issue follows the production engineering and supply chains environment, where the imposition of the integer domain results (due to inherent process features such as discrete slot sizes, etc.) in the Diophantine character of a scheduling problem. Consequently, some classes of MCPs scheduling problems can be...
متن کاملDeclarative approach to cyclic steady state space refinement: periodic process scheduling
Problems of cyclic scheduling are usually observed in flexible manufacturing systems which produce multitype parts where the automated guided vehicle system plays the role of a material handling system, as well as in various other multimodal transportation systems where goods and/or passenger itinerary planning plays a pivotal role. The schedulability analysis of the processes executed in the s...
متن کاملCyclic Steady State Refinement: Multimodal Processes Perspective
The cyclic scheduling problem modeled in terms of Cyclic Concurrent Process Systems is considered. The problem can be seen as a kind of Diophantine problem, hence its solvability, i.e. schedulability, plays a pivotal role in many supply-chain problems. In contradiction to the traditionally offered solutions the approach proposed allows one to take into account such behavioral features as transi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014